Erosion in Meanders

Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms

By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.

Meanders and Motzkin Words

River Restoration and Meanders

Among the most visually striking river restoration projects are those that involve the creation of a new channel, often in a new alignment and generally with a form and dimensions that are different from those of the preproject channel. These channel reconstruction projects often have the objective of creating a stable, single-thread, meandering channel, even on rivers that were not historicall...

Cutting Degree of Meanders

We study the cutting problems of meanders using 2-Motzkin words. These words uniquely define elevated peakless Motzkin paths, which under specific conditions correspond to meanders. A procedure for the determination of the set of meanders with a given sequence of cutting degrees, or with a given cutting degree, is presented by using proper conditions.

Meanders: Exact Asymptotics

We conjecture that meanders are governed by the gravitational version of a c = −4 two-dimensional conformal field theory, allowing for exact predictions for the meander configuration exponent α = √ 29( √ 29 + √ 5)/12, and the semi-meander exponent ᾱ = 1+ √ 11( √ 29+ √ 5)/24. This result follows from an interpretation of meanders as pairs of fully packed loops on a random surface, described by t...